Error bounds for Gauss-Kronrod quadrature formulae

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error Bounds for Gauss-kronrod Quadrature Formulae

The Gauss-Kronrod quadrature formula Qi//+X is used for a practical estimate of the error R^j of an approximate integration using the Gaussian quadrature formula Q% . Studying an often-used theoretical quality measure, for ߣ* , we prove best presently known bounds for the error constants cs(RTMx)= sup \RlK+x[f]\ ll/(l»lloo<l in the case s = "Sn + 2 + tc , k = L^J LfJ • A comparison with the Ga...

متن کامل

A Family of Gauss - Kronrod Quadrature Formulae

We show, for each n > 1, that the (2ra + l)-point Kronrod extension of the n-point Gaussian quadrature formula for the measure do-^t) = (1 + 7)2(1 t2)^2dt/((l + -y)2 47t2), -K -y < 1, has the properties that its n + 1 Kronrod nodes interlace with the n Gauss nodes and all its 2ra + 1 weights are positive. We also produce explicit formulae for the weights.

متن کامل

Error bounds for Gauss-Tur'an quadrature formulae of analytic functions

We study the kernels of the remainder term Rn,s(f) of GaussTurán quadrature formulas ∫ 1 −1 f(t)w(t) dt = n ∑

متن کامل

Stieltjes Polynomials and the Error of Gauss-kronrod Quadrature Formulas

The Gauss-Kronrod quadrature scheme, which is based on the zeros of Legendre polynomials and Stieltjes polynomials, is the standard method for automatic numerical integration in mathematical software libraries. For a long time, very little was known about the error of the Gauss-Kronrod scheme. An essential progress was made only recently, based on new bounds and as-ymptotic properties for the S...

متن کامل

Computation of Gauss-Kronrod quadrature rules

Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a symmetric tridiagonal matrix of order 2n+ 1 from certain mixed moments, and then computes a partial spectral factorization. We describe a new algorithm that does not require the entries of the tridiagonal matrix to b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1994

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-1994-1208221-0